P-code is an alternative term for bytecode, machine-independent code that achieves independence by targeting a p-code machine, a virtual machine designed for running p-code rather than the intention to emulate any specific hardware architecture.

<file format, software> A binary file containing an executable program, consisting of a sequence of (op code, data) pairs. Byte-code op codes are most often fixed size binary patterns, but can be variable size. The data portion consists of zero or more bits whose format typically depends on the op code. A byte-code program is interpreted by a {byte-code interpreter}. The advantage of this technique compared with outputing machine code for some particular processor is that the same byte-code can be executed on any processor on which the byte-code interpreter runs. The byte-code may be compiled to machine code ("native code") for speed of execution but this usually requires significantly greater effort for each new taraget architecture than simply porting the interpreter. For example, Java is compiled to byte-code which runs on the Java Virtual Machine. (2006-05-29)

<language> The intermediate language produced by the Pascal-P compiler. P-code is the assembly language for a hypothetical stack machine, the P-machine, said to imitate the instruction set of the Burroughs 6700. The term was first used in the Wirth reference below. Byte articles on writing a Pascal Compiler in Northstar BASIC (ca Aug 1978) also used the term. P-code was initially the intermediate code generated by the P2 compiler from ETH Zurich. P-code was later used as the intermediate language in the UCSD Pascal System, and in its two main derivatives, Apple Pascal and the UCSD P-system. Variants: P2 P-code, P4 P-code, UCSD P-code, LASL P-code. [Algorithms + Data Structures = Programs, N. Wirth, P-H 1976]. ["A Comparison of PASCAL Intermediate Languages", P.A. Nelson, SIGPLAN Notices 14(8):208-213, Aug 1979]. (2004-11-08)